Multiobjective PDE-constrained optimization using the reduced-basis method

نویسندگان

  • Laura Iapichino
  • S. Ulbrich
  • Stefan Volkwein
چکیده

In this paper the reduced basis method is utilized to solve multiobjective optimization problems governed by linear variational equations. These problems often arise in practical applications, where the quality of the system behavior has to be measured by more than one criterium. For the numerical solution the weighting sum method is applied. This approach leads to an algorithm, where many parameterized quadratic optimization problems are solved very efficiently by a appropriate reduced basis approximation. Further, the number of parameter variations is reduced by a sensitivity analysis for the parameterized objective.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems

Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...

متن کامل

Quasi-Newton Methods for Nonconvex Constrained Multiobjective Optimization

Here, a quasi-Newton algorithm for constrained multiobjective optimization is proposed. Under suitable assumptions, global convergence of the algorithm is established.

متن کامل

Accelerating PDE constrained optimization by the reduced basis method: application to batch chromatography

In this work, we show that the reduced basis method accelerates a PDE constrained optimization problem, where a nonlinear discretized system with a large number of degrees of freedom must be repeatedly solved during optimization. Such an optimization problem arises, for example, from batch chromatography. Instead of solving the full system of equations, a reduced model with a small number of eq...

متن کامل

A Certified Trust Region Reduced Basis Approach to PDE-Constrained Optimization

Parameter optimization problems constrained by partial differential equations (PDEs) appear in many science and engineering applications. Solving these optimization problems may require a prohibitively large number of computationally expensive PDE solves, especially if the dimension of the design space is large. It is therefore advantageous to replace expensive high-dimensional PDE solvers (e.g...

متن کامل

Construction of Parametrically-Robust CFD-Based Reduced-Order Models for PDE-Constrained Optimization

A method for simultaneously constructing a reduced-order model and using it as a surrogate model to solve a PDE-constrained optimization problem is introduced. A reducedorder model is built for the parameters corresponding to the initial guess of the optimization problem. Since the resulting reduced-order model can be expected to be accurate only in the vicinity of this point in the parameter s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Adv. Comput. Math.

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2017